Communication-optimal Parallel and Sequential Cholesky Decomposition
نویسندگان
چکیده
منابع مشابه
Communication-optimal Parallel and Sequential Cholesky Decomposition
Numerical algorithms have two kinds of costs: arithmetic and communication, by which we mean either moving data between levels of a memory hierarchy (in the sequential case) or over a network connecting processors (in the parallel case). Communication costs often dominate arithmetic costs, so it is of interest to design algorithms minimizing communication. In this paper we first extend known lo...
متن کاملCommunication-optimal Parallel and Sequential QR and LU Factorizations
We present parallel and sequential dense QR factorization algorithms that are both optimal (up to polylogarithmic factors) in the amount of communication they perform and just as stable as Householder QR. We prove optimality by deriving new lower bounds for the number of multiplications done by “non-Strassen-like” QR, and using these in known communication lower bounds that are proportional to ...
متن کاملCommunication-Optimal Parallel and Sequential Eigenvalue/SVD Algorithms
Algorithms have two costs: arithmetic and communication, by which we mean either moving data between levels of a memory hierarchy (in the sequential case) or over a network connecting processors (in the parallel case). The simplest metric of communication is to count the total number of words moved (also called the bandwidth cost). On current hardware the cost of moving a single word already gr...
متن کاملImplementing Communication-optimal Parallel and Sequential Qr Factorizations
We present parallel and sequential dense QR factorization algorithms for tall and skinny matrices and general rectangular matrices that both minimize communication, and are as stable as Householder QR. The sequential and parallel algorithms for tall and skinny matrices lead to significant speedups in practice over some of the existing algorithms, including LAPACK and ScaLAPACK, for example up t...
متن کاملParallel Communication Analysis for Sparse Cholesky Factorization Algorithms
We focus on linear systems stemming from discretization of PDEs. The non-zero structure of matrices of such systems depends on the discretized domain and the stencil in use. Analyzing parallel communication for an arbitraty problem seems unfeasible. Thus, we are dealing with a model problem: a square k-by-k mesh and a 5-point stencil. Presumably, the results for other stencils using the same me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2010
ISSN: 1064-8275,1095-7197
DOI: 10.1137/090760969